منابع مشابه
Activity Mining: Challenges and Prospects
Activity data accumulated in real life, e.g. in terrorist activities and fraudulent customer contacts, presents special structural and semantic complexities. However, it may lead to or be associated with significant business impacts. For instance, a series of terrorist activities may trigger a disaster to the society, large amounts of fraudulent activities in social security program may result ...
متن کاملImproving the Prospects for Educational Data Mining
Data mining is an important paradigm for educational assessment. The usual assumption is that mining is performed after educational activity with that activity having been designed without regard for the mining process. This paper discusses how the prospects for successful mining can be improved by imposing constraints or biases on the activities and instruments that generate the data. These bi...
متن کاملDomain Driven Data Mining Challenges Prospects
The data driven mining technology was applied in the most of the existing behavior here we assume the strategy of domain driven data mining and utilize Real word business requirements and problems are and prospects. Data driven business world is heading—and what challenges and opportunities CEOs see in 80% place data mining and analysis as the second-most their organization's growth prospects. ...
متن کاملMining Extreme Values: Climate and Natural Hazards
The analysis and modeling of extreme values have traditionally relied on extreme value theory (EVT), which in turn has tended to focus on limiting or asymptotic cases and assumptions of independence. However, disciplines from climate science and digital mapping to infrastructure security and transportation, have been generating massive volumes of data with multidimensional and multivariable dep...
متن کاملAn Extreme Point Tabu Search Method for Data Mining
We propose an Extreme Point Tabu Search (EPTS) algorithm that constructs globally optimal decision trees for classiication problems. Typically, decision tree algorithms are greedy. They optimize the misclassiication error of each decision sequentially. Our non-greedy approach minimizes the misclassiication error of all the decisions in the tree concurrently. Decision trees are ideal for data-mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2013
ISSN: 0028-0836,1476-4687
DOI: 10.1038/495s4a